Local and global tameness in Krull monoids
نویسندگان
چکیده
Let H be a Krull monoid with finite class group G such that every class contains a prime divisor. Then the global tame degree t(H) equals zero if and only if H is factorial (equivalently, |G| = 1). If |G| > 1, then D(G) ≤ t(H) ≤ 1 + D(G) (
منابع مشابه
On the Arithmetic of Krull Monoids with Infinite Cyclic Class Group
Let H be a Krull monoid with infinite cyclic class group G and let GP ⊂ G denote the set of classes containing prime divisors. We study under which conditions on GP some of the main finiteness properties of factorization theory—such as local tameness, the finiteness and rationality of the elasticity, the structure theorem for sets of lengths, the finiteness of the catenary degree, and the exist...
متن کاملNon-commutative Krull Monoids: a Divisor Theoretic Approach and Their Arithmetic
A (not necessarily commutative) Krull monoid—as introduced by Wauters—is defined as a completely integrally closed monoid satisfying the ascending chain condition on divisorial two-sided ideals. We study the structure of these Krull monoids, both with ideal theoretic and with divisor theoretic methods. Among others we characterize normalizing Krull monoids by divisor theories. Based on these re...
متن کاملTwo-dimensional projectively-tameness over Noetherian domains of dimension one
In this paper all coordinates in two variables over a Noetherian Q-domain of Krull dimension one are proved to be projectively tame. In order to do this, some results concerning projectively-tameness of polynomials in general are shown. Furthermore, we deduce that all automorphisms in two variables over a Noetherian reduced ring of dimension zero are tame.
متن کاملA New Characterization of Half-factorial Krull Monoids
Let M be a Krull monoid. Then every element of M may be written as a finite product of irreducible elements. If for every a ∈ M , each two factorizations of a have the same number of irreducible elements, then M is called half-factorial. Using a property of element exponentiation, we provide a new characterization of half-factoriality, valid for all Krull monoids whose class group has torsion-f...
متن کاملThe Power of Programs over Monoids in DA
The program-over-monoid model of computation originates with Barrington’s proof that it captures the complexity class NC1. Here we make progress in understanding the subtleties of the model. First, we identify a new tameness condition on a class of monoids that entails a natural characterization of the regular languages recognizable by programs over monoids from the class. Second, we prove that...
متن کامل